Finding all real zeros of polynomial systems using multi-resultant

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simultaneous Methods for Finding All Zeros of a Polynomial

The purpose of this paper is to present three new methods for finding all simple zeros of polynomials simultaneously. First, we give a new method for finding simultaneously all simple zeros of polynomials constructed by applying the Weierstrass method to the zero in the trapezoidal Newton’s method, and prove the convergence of the method. We also present two modified Newton’s methods combined w...

متن کامل

Singular Zeros of Polynomial Systems

Singular zeros of systems of polynomial equations constitute a bottleneck when it comes to computing, since several methods relying on the regularity of the Jacobian matrix of the system do not apply when the latter has a non-trivial kernel. Therefore they require special treatment. The algebraic information regarding an isolated singularity can be captured by a finite, local basis of different...

متن کامل

Polynomial Sequences with Only Real Zeros

In this paper we develop methods to provide unified approaches to the reality of zeros of polynomial sequences satisfying certain recurrence relations and then apply them to derive some known results and solve certain open problems and conjectures.

متن کامل

Probability of all real zeros for random polynomial with the exponential ensemble

Abstract: The probability that a random polynomial of degree n with i.i.d exponentially distributed coefficients has all real zeros is P(All zeros are real) = E ∏ 1≤j<k≤n |Uj − Uk| = ( n−1 ∏

متن کامل

On annuli containing all the zeros of a polynomial

In this paper, we obtain the annuli that contain all the zeros of the polynomial p(z) = a 0 + a 1 z + a 2 z 2 + · · · + a n z n , where a i 's are complex coefficients and z is a complex variable. Our results sharpen some of the recently obtained results in this direction. Also, we develop a MATLAB code to show that for some polynomials the bounds obtained by our results are considerably sharpe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2004

ISSN: 0377-0427

DOI: 10.1016/j.cam.2003.10.009